Equivariant algorithms for constraint satisfaction problems over coset templates
نویسندگان
چکیده
منابع مشابه
Equivariant algorithms for constraint satisfaction problems over coset templates
We investigate the Constraint Satisfaction Problem (CSP) over templates with a group structure, and algorithms solving CSP that are equivariant, i.e. invariant under a natural group action induced by a template. Our main result is a method of proving the implication: if CSP over a coset template T is solvable by an equivariant algorithm then T is 2-Helly (or equivalently, has a majority polymor...
متن کاملTractable Quantified Constraint Satisfaction Problems over Positive Temporal Templates
A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over a dense linear order of rational numbers using a relational symbol ≤, logical conjunction and disjunction. We provide a complexity characterization for quantified constraint satisfaction problems (QCSP) over positive temporal languages. The considered QCSP prob...
متن کاملConstraint Satisfaction Problems with Infinite Templates
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs over infinite templates can be formulated with templates that are ω-categorical. We survey examples of such problems in temporal and spatial reasoning, infinite-dimensional algebra, acyclic colorings in graph theory, ...
متن کاملExact algorithms for constraint satisfaction problems
The Boolean satisfiability problem (SAT) and its generalization to variables of higher arities – constraint satisfaction problems (CSP) – can arguably be called the most “natural” of all NP-complete problems. The present work is concerned with their algorithmic treatment. It consists of two parts. The first part investigates CSPs for which satisfiability follows from the famous Lovász Local Lem...
متن کاملBelief propagation algorithms for constraint satisfaction problems
Belief propagation algorithms for constraint satisfaction problems by Elitza Nikolaeva Maneva Doctor of Philosophy in Computer Science and the Designated Emphasis in Communication, Computation, and Statistics University of California, Berkeley Professor Alistair Sinclair, Chair We consider applications of belief propagation algorithms to Boolean constraint satisfaction problems (CSPs), such as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2017
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2016.09.009